On random minimum lenght spanning trees
نویسندگان
چکیده
منابع مشابه
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Though we might expect that random keys, with an additional level of indirection, would provide inferior performance compared with permutations, a genetic algorithm that encodes spanning trees with random keys is as effect...
متن کاملOptimal random matchings, tours, and spanning trees in hierarchically separated trees
We derive tight bounds on the expected weights of several combinatorial optimization problems for random point sets of size n distributed among the leaves of a balanced hierarchically separated tree. We consider monochromatic and bichromatic versions of the minimum matching, minimum spanning tree, and traveling salesman problems. We also present tight concentration results for the monochromatic...
متن کاملEdge sets: an effective evolutionary coding of spanning trees
The fundamental design choices in an evolutionary algorithm are its representation of candidate solutions and the operators that will act on that representation. We propose representing spanning trees in evolutionary algorithms for network design problems directly as sets of their edges, and we describe initialization, recombination, and mutation operators for this representation. The operators...
متن کاملOn Random Minimum Length Spanning Trees
Suppose that we are given a complete graph K n on n vertices together with lengths on the edges which are independent identically distributed non-negative random variables. Suppose that their common distribution function F satisfies F(0) =0, F is differentiable from the right at zero and D = F~. (0)>0. Let X denote a random variable with this distribution. Let L~ denote the (random) length of t...
متن کاملRepresenting all Minimum Spanning Trees with Applications to Counting and Generation
We show that for any edge-weighted graph G there is an equivalent graph EG such that the minimum spanning trees of G correspond one-for-one with the spanning trees of EG. The equivalent graph can be constructed in time O(m + n log n) given a single minimum spanning tree of G. As a consequence we can count the minimum spanning trees of G in time O(m+ n), generate a random minimum spanning tree i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 9 شماره
صفحات -
تاریخ انتشار 1989